Computation in Coxeter groups II. Constructing minimal roots

نویسنده

  • Bill Casselman
چکیده

In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that paper I discussed how this algorithm could be used to build the reflection table of minimal roots, which could in turn form the basis of a much more efficient multiplication algorithm. In this paper, following a suggestion of Robert Howlett, I explain how results due to Brigitte Brink can be used to construct the minimal root reflection table directly and more efficiently.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computation in Coxeter Groups Ii. Minimal Roots

In the recent paper (Casselman, 2001) I described how a number of ideas due to Fokko du Cloux and myself could be incorporated into a reasonably efficient program to carry out multiplication in arbitrary Coxeter groups. At the end of that paper I discussed how this algorithm could be used to build the reflection table of minimal roots, which could in turn form the basis of a much more efficient...

متن کامل

Co-growth of Parabolic Subgroups of Coxeter Groups

In this article, we consider infinite, non-affine Coxeter groups. These are known to be of exponential growth. We consider the subsets of minimal length coset representatives of parabolic subgroups and show that these sets also have exponential growth. This is achieved by constructing a reflection subgroup of our Coxeter group which is isomorphic to the universal Coxeter group on three generato...

متن کامل

On Coxeter Diagrams of complex reflection groups

We study complex Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over E = Z[e2πi/3]: there are only four such lattices, namely, the E–lattices whose real forms are A2, D4, E6 and E8. Next, we address the issue of characterizing the diagrams for unitary reflection groups, a question...

متن کامل

A New Proof of a Theorem of Solomon

The main purpose of this note is to give another proof and a different view of a theorem of Solomon [3] on Coxeter groups (finite groups of symmetries of R generated by reflections). A secondary purpose is to give more publicity to the fascinating special case of symmetric groups. This case was handled by Etienne whose recent paper [2] kindled my interest in this subject; I owe to Michelle Wach...

متن کامل

On Minimal Covolume Hyperbolic Lattices

We study lattices with a non-compact fundamental domain of small volume in hyperbolic space Hn. First, we identify the arithmetic lattices in Isom+Hn of minimal covolume for even n up to 18. Then, we discuss the related problem in higher odd dimensions and provide solutions for n = 11 and n = 13 in terms of the rotation subgroup of certain Coxeter pyramid groups found by Tumarkin. The results d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007